An index theory for uniformly locally finite graphs

An index theory for uniformly locally finite (ULF) graphs is developed based on the adjacency operator A acting on the space of bounded sequences defined on the vertices. It turns out that the characterization by upper and lower nonnegative eigenvectors is an appropriate tool to overcome the difficulties imposed by the `∞–setting. A distinctive property of the spectral radius r∞(A) in `∞ is the identity r∞ = sup {λ ≥ 0 ∃x ∈ `∞(Γ), x > 0 : Ax ≥ λx} =: I, while the `–spectral radius r2 of the adjacency operator satisfies r2 = inf {λ ≥ 0 ∃x ∈ `∞(Γ), x > 0 : Ax ≤ λx} . The index I, as well as other order indices, can serve in classifying ULF graphs and enables connections with various graph invariants. E.g., the chromatic number can be estimated from above by 1 + r∞. Moreover, results on the index I in the periodic case, the regular one and for graphs having only finitely many essential ramification nodes are presented.